Structures for Multiplicative Cyclic Linear Logic: Deepness vs Cyclicity
نویسنده
چکیده
The aim of this work is to give an alternative presentation for the multiplicative fragment of Yetter’s cyclic linear logic. The new presentation is inspired by the calculus of structures, and has the interesting feature of avoiding the cyclic rule. The main point in this work is to show how cyclicity can be substituted by deepness, i.e. the possibility of applying an inference rule at any point of a formula. We finally derive, through a new proof technique, the cut elimination property of the calculus. keywords: proof theory, linear logic, cyclic linear logic, calculus of structures, Lambek calculus.
منابع مشابه
Cyclic Multiplicative-Additive Proof Nets of Linear Logic with an Application to Language Parsing
This paper concerns a logical approach to natural language parsing based on proof nets (PNs), i.e. de-sequentialized proofs, of linear logic (LL). It first provides a syntax for proof structures (PSs) of the cyclic multiplicative and additive fragment of linear logic (CyMALL). A PS is an oriented graph, weighted by boolean monomial weights, whose conclusions Γ are endowed with a cyclic order σ....
متن کاملNon-Commutative Logic I: The Multiplicative Fragment
We introduce proof nets and sequent calculus for the multiplicative fragment of non-commutative logic, which is an extension of both linear logic and cyclic linear logic. The two main technical novelties are a third switching position for the non-commutative disjunction, and the structure of order variety.
متن کاملLambek calculus is NP-complete
We prove that for both the Lambek calculus L and the Lambek calculus allowing empty premises L∗ the derivability problem is NP-complete. It follows that also for the multiplicative fragments of cyclic linear logic and noncommutative linear logic the derivability problem is NP-complete.
متن کاملProof Nets for Multiplicative Cyclic Linear Logic and Lambek Calculus
This paper presents a simple and intuitive syntax for proof nets of the multiplicative cyclic fragment (McyLL) of linear logic (LL). The proposed correctness criterion for McyLL proof nets can be considered as the non-commutative counterpart of the famous Danos contraction criterion for proof nets of the pure multiplicative fragment (MLL) of LL. Unlike the most part of current syntaxes for non-...
متن کاملNon-commutativity and MELL in the Calculus of Structures
We introduce the calculus of structures: it is more general than the sequent calculus and it allows for cut elimination and the subformula property. We show a simple extension of multiplicative linear logic, by a self-dual noncommutative operator inspired by CCS, that seems not to be expressible in the sequent calculus. Then we show that multiplicative exponential linear logic benefits from its...
متن کامل